2 00 9 the Eilenberg - Watts Theorem over Schemes
نویسنده
چکیده
We study obstructions to a direct limit preserving right exact functor F between categories of quasi-coherent sheaves on schemes being isomorphic to tensoring with a bimodule. When the domain scheme is affine, or if F is exact, all obstructions vanish and we recover the Eilenberg-Watts Theorem. This result is crucial to the proof that the noncommutative Hirzebruch surfaces constructed in [3] are noncommutative P-bundles in the sense of [6].
منابع مشابه
2 7 Fe b 20 09 THE EILENBERG - WATTS THEOREM OVER SCHEMES
We describe obstructions to a direct limit preserving right exact functor between categories of quasi-coherent sheaves on schemes being isomorphic to tensoring with a bimodule. When the domain scheme is affine, all obstructions vanish and we recover the Eilenberg-Watts Theorem. We use our description of these obstructions to prove that if a direct limit preserving right exact functor F from a s...
متن کاملThe Eilenberg-watts Theorem over Schemes
We describe obstructions to a direct limit preserving right exact functor between categories of quasi-coherent sheaves on schemes being isomorphic to tensoring with a bimodule. When the domain scheme is affine, all obstructions vanish and we recover the Eilenberg-Watts Theorem. We use our description of these obstructions to prove that if a direct limit preserving right exact functor F from a s...
متن کاملCommutants of von Neumann Correspondences and Duality of Eilenberg-Watts Theorems by Rieffel and by Blecher
The category of von Neumann correspondences from B to C (or von Neumann B–C–modules) is dual to the category of von Neumann correspondences from C to B via a functor that generalizes naturally the functor that sends a von Neumann algebra to its commutant and back. We show that under this duality, called commutant, Rieffel’s Eilenberg-Watts theorem (on functors between the categories of represen...
متن کاملFinite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al
Eilenberg, Elgot and Shepherdson showed in 1969, [9], that a relation on finite words over a finite, non-unary alphabet with p letters is definable in the first order logic with p + 2 predicates for the relations equal length, prefix and last letter is a (for each letter a ∈ Σ) if and only if it can be recognized by a finite multitape synchronous automaton, i.e., one whose read heads move simul...
متن کاملBrown Representability and the Eilenberg-watts Theorem in Homotopical Algebra
It is well-known that every homology functor on the stable homotopy category is representable, so of the form E∗(X) = π∗(E ∧ X) for some spectrum E. However, Christensen, Keller, and Neeman [CKN01] have exhibited simple triangulated categories, such as the derived category of k[x, y] for sufficiently large fields k, for which not every homology functor is representable. In this paper, we show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009